Decomposition and tractability in qualitative spatial and temporal reasoning
نویسندگان
چکیده
منابع مشابه
Decomposition and tractability in qualitative spatial and temporal reasoning
Constraint networks in qualitative spatial and temporal reasoning (QSTR) typically feature variables defined on infinite domains. Mainstream algorithms for deciding network consistency are based on searching for network refinements whose consistency is known to be tractable, either directly or by using a SAT solver. Consequently, these algorithms treat all networks effectively as complete graph...
متن کاملQualitative Temporal and Spatial Reasoning Revisited
Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. A central question for the various proposed temporal and spatial constraint languages is whether local consistency implies global consistency. Showing that a constraint language Γ has this “local-to-global” property implies polynomial-time tractability of the constraint language, and has ...
متن کاملQualitative Spatial and Temporal Reasoning in Cardiac Electrophysiology
We have space here to give only the briefest outline of the processes we are trying to model; the interested reader should consult one of the standard textS2. The heart consists of four chambers: two atria and two ventricles . Electrically, however, the two atria can be considered as one, and we shall refer only to the atrium ; likewise for the two ventricles. In essence the function of the car...
متن کاملQualitative Spatial and Temporal Reasoning with AND/OR Linear Programming
This paper explores the use of generalized linear programming techniques to tackle two long-standing problems in qualitative spatio-temporal reasoning: Using LP as a unifying basis for reasoning, one can jointly reason about relations from different qualitative calculi. Also, concrete entities (fixed points, regions fixed in shape and/or position, etc.) can be mixed with free variables. Both fe...
متن کاملCompactness and Its Implications for Qualitative Spatial and Temporal Reasoning
A constraint satisfaction problem has compactness if any infinite set of constraints is satisfiable whenever all its finite subsets are satisfiable. We prove a sufficient condition for compactness, which holds for a range of problems including those based on the well-known Interval Algebra (IA) and RCC8. Furthermore, we show that compactness leads to a useful necessary and sufficient condition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2013
ISSN: 0004-3702
DOI: 10.1016/j.artint.2012.09.009